'Weak Dependency Graph [60.0]'
------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(a(b(x1))) -> b(c(b(a(a(a(x1))))))
, a(c(x1)) -> x1}
Details:
We have computed the following set of weak (innermost) dependency pairs:
{ a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))
, a^#(c(x1)) -> c_1()}
The usable rules are:
{ a(a(b(x1))) -> b(c(b(a(a(a(x1))))))
, a(c(x1)) -> x1}
The estimated dependency graph contains the following edges:
{a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
==> {a^#(c(x1)) -> c_1()}
{a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
==> {a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
We consider the following path(s):
1) { a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))
, a^#(c(x1)) -> c_1()}
The usable rules for this path are the following:
{ a(a(b(x1))) -> b(c(b(a(a(a(x1))))))
, a(c(x1)) -> x1}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(a(b(x1))) -> b(c(b(a(a(a(x1))))))
, a(c(x1)) -> x1
, a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))
, a^#(c(x1)) -> c_1()}
Details:
We apply the weight gap principle, strictly orienting the rules
{a^#(c(x1)) -> c_1()}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(c(x1)) -> c_1()}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [0]
c_1() = [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a(c(x1)) -> x1}
and weakly orienting the rules
{a^#(c(x1)) -> c_1()}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a(c(x1)) -> x1}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [8]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [1] x1 + [9]
c_1() = [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
and weakly orienting the rules
{ a(c(x1)) -> x1
, a^#(c(x1)) -> c_1()}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [8]
c(x1) = [1] x1 + [8]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [1] x1 + [1]
c_1() = [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(a(b(x1))) -> b(c(b(a(a(a(x1))))))}
Weak Rules:
{ a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))
, a(c(x1)) -> x1
, a^#(c(x1)) -> c_1()}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(a(b(x1))) -> b(c(b(a(a(a(x1))))))}
Weak Rules:
{ a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))
, a(c(x1)) -> x1
, a^#(c(x1)) -> c_1()}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ b_0(2) -> 2
, c_0(2) -> 2
, a^#_0(2) -> 1
, c_1_0() -> 1}
2) {a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
The usable rules for this path are the following:
{ a(a(b(x1))) -> b(c(b(a(a(a(x1))))))
, a(c(x1)) -> x1}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(a(b(x1))) -> b(c(b(a(a(a(x1))))))
, a(c(x1)) -> x1
, a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
Details:
We apply the weight gap principle, strictly orienting the rules
{a(c(x1)) -> x1}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a(c(x1)) -> x1}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [8]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [0]
c_1() = [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
and weakly orienting the rules
{a(c(x1)) -> x1}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [8]
c(x1) = [1] x1 + [9]
a^#(x1) = [1] x1 + [8]
c_0(x1) = [1] x1 + [0]
c_1() = [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(a(b(x1))) -> b(c(b(a(a(a(x1))))))}
Weak Rules:
{ a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))
, a(c(x1)) -> x1}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(a(b(x1))) -> b(c(b(a(a(a(x1))))))}
Weak Rules:
{ a^#(a(b(x1))) -> c_0(a^#(a(a(x1))))
, a(c(x1)) -> x1}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ b_0(2) -> 2
, b_0(3) -> 2
, c_0(2) -> 3
, c_0(3) -> 3
, a^#_0(2) -> 4
, a^#_0(3) -> 4}